Real numbers having ultimately periodic representations in abstract numeration systems
نویسندگان
چکیده
Using a genealogically ordered infinite regular language, we know how to represent an interval ofR. Numbers having an ultimately periodic representation play a special role in classical numeration systems. The aim of this paper is to characterize the numbers having an ultimately periodic representation in generalized systems built on a regular language. The syntactical properties of these words are also investigated. Finally, we show the equivalence of the classical -expansions with our generalized representations in some special case related to a Pisot number . © 2004 Elsevier Inc. All rights reserved.
منابع مشابه
Abstract beta-expansions and ultimately periodic representations
beta-expansions and ultimately periodic representations Michel Rigo, Wolfgang Steiner To cite this version: Michel Rigo, Wolfgang Steiner. Abstract beta-expansions and ultimately periodic representations. Journal de Théorie des Nombres de Bordeaux, Société Arithmétique de Bordeaux, 2005, 17, pp.283-299. HAL Id: hal-00023235 https://hal.archives-ouvertes.fr/hal-00023235 Submitted on 21 Apr 2006 ...
متن کاملRepresenting Real Numbers in a Generalized Numeration Systems
We show how to represent an interval of real numbers in an abstract numeration system built on a language that is not necessarily regular. As an application, we consider representations of real numbers using the Dyck language. We also show that our framework can be applied to the rational base numeration systems.
متن کاملA Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems
Consider a non-standard numeration system like the one built over the Fibonacci sequence where nonnegative integers are represented by words over {0, 1} without two consecutive 1. Given a set X of integers such that the language of their greedy representations in this system is accepted by a finite automaton, we consider the problem of deciding whether or not X is a finite union of arithmetic p...
متن کاملMulti-dimensional sets recognizable in all abstract numeration systems
numeration systems An abstract numeration system is a triple S = (L,Σ, <) where L is an infinite regular language over the totally ordered alphabet (Σ, <) By enumerating words of L in the radix order (induced by <), we define a one-to-one correspondence between N and L repS : N → L : n 7→ (n + 1)th word of L valS = rep −1 S : L → N Abstract numeration systems Example S = (a∗b∗, {a, b}, a < b) L...
متن کاملCombinatorics, Automata and Number Theory
numeration systems The motivation for the introduction of abstract numeration systems stemsfrom the celebrated theorem of Cobham dating back to 1969 about the so-called recognisable sets of integers in any integer base numeration system.An abstract numeration system is simply an infinite genealogically ordered(regular) language. In particular, this notion extends the usual integ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 192 شماره
صفحات -
تاریخ انتشار 2004